Rainbow Arithmetic Progressions and Anti-Ramsey Results
نویسندگان
چکیده
The van der Waerden theorem in Ramsey theory states that, for every k and t and sufficiently large N, every k-colouring of [N] contains a monochromatic arithmetic progression of length t. Motivated by this result, Radoičić conjectured that every equinumerous 3-colouring of [3n] contains a 3-term rainbow arithmetic progression, i.e., an arithmetic progression whose terms are coloured with distinct colours. In this paper, we prove that every 3-colouring of the set of natural numbers for which each colour class has density more than 1/6, contains a 3-term rainbow arithmetic progression. We also prove similar results for colourings of Zn. Finally, we give a general perspective on other anti-Ramsey-type problems that can be considered.
منابع مشابه
Rainbow Ramsey Theory
This paper presents an overview of the current state in research directions in the rainbow Ramsey theory. We list results, problems, and conjectures related to existence of rainbow arithmetic progressions in [n] and N. A general perspective on other rainbow Ramsey type problems is given.
متن کاملOn rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملRainbow Arithmetic Progressions
In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers n and k, the expression aw([n], k) denotes the smallest number of colors with which the integers {1, . . . , n} can be colored and still guarantee there is a rainbow arithmetic progression of length k. We establish that aw([n], 3) = Θ(log n) and aw([n...
متن کاملPolynomial Configurations on Integer Subsets with Positive Density
Abstract. Szemerédi’s Theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized it, showing that sets of integers with positive upper density contain arbitrarily long polynomial configurations; Szemerédi’s Theorem corresponds to the linear case of this polynomial theorem. We focus on the case farthest f...
متن کاملSub-Ramsey Numbers for Arithmetic Progressions and Schur Triples
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainbow AP (m); that is, an m-term arithmetic progression, all of whose terms receive different colors. We prove that 17 8 k +O(1) ≤ sr(3, k) ≤ 15 7 k + O(1) and sr(m, 2) > ⌊ 2 2 ⌋, improving the previous bounds of Alon, Caro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 12 شماره
صفحات -
تاریخ انتشار 2003